Bi-Distance Pattern Uniform Number
نویسنده
چکیده
A graph G = (V,E) is BiDistance Pattern Uniform if there exists M ⊆ V (G) such that the M−distance pattern fM(u) = {d(u, v) : v ∈ M} is identical for all u in M and fM (v) is identical for all v in V −M. The set M is called Bi-DPU set. The least cardinality of Bi-DPU set in G is called the Bi-DPU number of G. In this paper, we initiate a study on Bi-DPU number of different classes of graphs. Mathematics Subject Classification: 05C78
منابع مشابه
Determination of Spatial Distribution Pattern Analysis of Acer Velutinum Species in two Elevation Classes using Distance Sampling Methods (Case Study: Asalem Nav Forests, Series No. 2)
One of the important features of plant communities is the spatial pattern of trees. The spatial pattern of the stands determined by measuring and positioning of trees in the stands and inserting them in analytical frameworks. This is because spatial information allows natural resource managers to make and perform better-informed decisions, -. The aim of this study was to assess the spatial patt...
متن کاملLandmarks: a New Model for Similarity-based Pattern Querying in Time Series Databases
In this paper we present the Landmark Model, a model for time series that yields new techniques for similarity-based time series pattern querying. The Landmark Model does not follow traditional similarity models that rely on pointwise Euclidean distance. Instead, it leads to Landmark Similarity, a general model of similarity that is consistent with human intuition and episodic memory. By tracki...
متن کاملUniform Number of a Graph
We introduce the notion of uniform number of a graph. The uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...
متن کاملIndependent Complementary Distance Pattern Uniform Graphs
A graph G = (V,E) is called to be Smarandachely uniform k-graph for an integer k ≥ 1 if there exists M1,M2, · · · ,Mk ⊂ V (G) such that fMi(u) = {d(u, v) : v ∈ Mi} for ∀u ∈ V (G)−Mi is independent of the choice of u ∈ V (G)−Mi and integer i, 1 ≤ i ≤ k. Each such set Mi, 1 ≤ i ≤ k is called a CDPU set [6, 7]. Particularly, for k = 1, a Smarandachely uniform 1-graph is abbreviated to a complement...
متن کاملImage retrieval using histograms of uni-color and bi-color blocks and directional changes in intensity gradient
In this paper, we present a new and effective image indexing technique that employs local uni-color and bi-color distributions and local directional distribution of intensity gradient. The image is divided into 4 by 4 non-overlapping blocks. Each block, based on its gradient magnitude, is classified as uniform or non-uniform. Using the average of each color component for the pixels of a uniform...
متن کامل